compress/flate.tableEntryPrev.cur (field)

63 uses

	compress/flate (current package)
		deflatefast.go#L144: 	cur  tableEntry
		level3.go#L38: 			if v.cur.offset <= minOff {
		level3.go#L39: 				v.cur.offset = 0
		level3.go#L41: 				v.cur.offset = v.cur.offset - e.cur + maxMatchOffset
		level3.go#L90: 			e.table[nextHash] = tableEntryPrev{prev: candidates.cur, cur: tableEntry{offset: s + e.cur}}
		level3.go#L93: 			candidate = candidates.cur
		level3.go#L159: 						prev: e.table[nextHash].cur,
		level3.go#L160: 						cur:  tableEntry{offset: e.cur + t},
		level3.go#L170: 					prev: e.table[nextHash].cur,
		level3.go#L171: 					cur:  tableEntry{offset: e.cur + i}}
		level3.go#L179: 				prev: e.table[prevHash].cur,
		level3.go#L180: 				cur:  tableEntry{offset: e.cur + s - 2},
		level3.go#L186: 				prev: e.table[prevHash].cur,
		level3.go#L187: 				cur:  tableEntry{offset: e.cur + s - 1},
		level3.go#L194: 				prev: candidates.cur,
		level3.go#L195: 				cur:  tableEntry{offset: s + e.cur},
		level3.go#L199: 			candidate = candidates.cur
		level5.go#L43: 			if v.cur.offset <= minOff {
		level5.go#L44: 				v.cur.offset = 0
		level5.go#L47: 				v.cur.offset = v.cur.offset - e.cur + maxMatchOffset
		level5.go#L105: 			eLong.cur, eLong.prev = entry, eLong.cur
		level5.go#L110: 			t = lCandidate.cur.offset - e.cur
		level5.go#L116: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level5.go#L135: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level5.go#L149: 				eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level5.go#L152: 				t2 := lCandidate.cur.offset - e.cur
		level5.go#L195: 			eLong := e.bTable[hashLen(loadLE64(src, sAt), tableBits, hashLongBytes)].cur.offset
		level5.go#L241: 			eLong.cur, eLong.prev = t, eLong.cur
		level5.go#L247: 			eLong.cur, eLong.prev = t, eLong.cur
		level5.go#L261: 				eLong.cur, eLong.prev = t, eLong.cur
		level5.go#L274: 		eLong.cur, eLong.prev = tableEntry{offset: o}, eLong.cur
		level6.go#L43: 			if v.cur.offset <= minOff {
		level6.go#L44: 				v.cur.offset = 0
		level6.go#L47: 				v.cur.offset = v.cur.offset - e.cur + maxMatchOffset
		level6.go#L104: 			eLong.cur, eLong.prev = entry, eLong.cur
		level6.go#L110: 			t = lCandidate.cur.offset - e.cur
		level6.go#L118: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level6.go#L139: 					eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level6.go#L155: 				eLong.cur, eLong.prev = tableEntry{offset: nextS + e.cur}, eLong.cur
		level6.go#L172: 				t2 = lCandidate.cur.offset - e.cur
		level6.go#L217: 			t2 := eLong.cur.offset - e.cur - l + skipBeginning
		level6.go#L269: 				eLong.cur, eLong.prev = tableEntry{offset: i + e.cur}, eLong.cur
		level6.go#L282: 			eLong.cur, eLong.prev = t, eLong.cur
		level6.go#L283: 			eLong2.cur, eLong2.prev = t2, eLong2.cur